On the enumeration of d-minimal permutations
نویسندگان
چکیده
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of such permutations in terms of (several) sums of determinants. We then generalize the class of skew Young tableaux under consideration; this allows in particular to recover a formula for Eulerian numbers which is a direct consequence of a result of MacMahon.
منابع مشابه
Enumeration of Two Particular Sets of Minimal Permutations
Minimal permutations with d descents and size d+2 have a unique ascent between two sequences of descents. Our aim is the enumeration of two particular sets of these permutations. The first set contains the permutations having d+2 as the top element of the ascent. The permutations in the latter set have 1 as the last element of the first sequence of descents and are the reverse-complement of tho...
متن کاملRefined Enumeration of Minimal Transitive Factorizations of Permutations
Minimal transitive cycle factorizations, parking functions and labeled trees are related very closely. Using the correspondences between them, we find a refined enumeration of minimal transitive factorizations of permutations of type (1, n− 1) and (2, n− 2).
متن کاملPosets and permutations in the duplication-loss model: Minimal permutations with d descents
In this paper, we are interested in the combinatorial analysis of the whole genome duplication random loss model of genome rearrangement initiated in [8] and [7]. In this model, genomes composed of n genes are modelled by permutations of the set of integers [1..n], that can evolve through duplication-loss steps. It was previously shown that the class of permutations obtained in this model after...
متن کاملThe enumeration of simple permutations
A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary generating function for simple permutations and that for all permutations, that the coefficients of this series are not P -recursive, an asymptotic expansion for ...
متن کاملPosets and Permutations in the duplication-loss model
In this paper, we are interested in the combinatorial analysis of the whole genome duplication random loss model of genome rearrangement initiated in [8] and [7]. In this model, genomes composed of n genes are modeled by permutations of the set of integers [1..n], that can evolve through duplication-loss steps. It was previously shown that the class of permutations obtained in this model after ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 15 شماره
صفحات -
تاریخ انتشار 2013